† Corresponding author. E-mail:
Project supported by the National Natural Science Foundation of China (Grant Nos. 11222430, 11434011, and 11474049), the National Basic Research Program of China (Grant No. 2012CB922104), the Fundamental Research Funds for the Central Universities, China, and the Research Funds of Renmin University of China (Grant No. 16XNLQ03).
The stopping time of a one-dimensional bounded classical random walk (RW) is defined as the number of steps taken by a random walker to arrive at a fixed boundary for the first time. A quantum walk (QW) is a non-trivial generalization of RW, and has attracted a great deal of interest from researchers working in quantum physics and quantum information. In this paper, we develop a method to calculate the stopping time for a one-dimensional QW. Using our method, we further compare the properties of stopping time for QW and RW. We find that the mean value of the stopping time is the same for both of these problems. However, for short times, the probability for a walker performing a QW to arrive at the boundary is larger than that for a RW. This means that, although the mean stopping time of a quantum and classical walker are the same, the quantum walker has a greater probability of arriving at the boundary earlier than the classical walker.
The random walk (RW) has been an important mathematical problem in probability theory and stochastic processes.[1] The quantum walk (QW)[2] is a nontrivial extension of the classical RW, in which the walker obeys quantum mechanical rules. Because of quantum interference effects, the properties of QW are significantly different from those of RW.[3]
A motivation for the study on QW is to develop new quantum algorithms, which provide exponential speed-ups[4–10] when compared with classical algorithms. In addition, QW is a valuable model for studying physical processes of several important quantum protocols.[11–24] QW has been realized in kinds of experiments involving linear optical systems,[25–31] cold atoms on an optical lattice,[32] trapped ions,[33,34] nuclear magnetic resonance techniques,[35,36] optical waveguides,[37] and optical fiber networks.[38] Moreover, recent researches proposed schemes to realize QW with quantum dots system.[39,40]
In previous work, the research on QW has mainly focused on the probability distribution of the position of a quantum walker after a fixed number of steps.[11–24] In RW theory, there is another important concept called stopping time.[41] The stopping time is defined as the number of steps at which a random walker arrives at a fixed boundary for the first time. For a RW with given boundaries, the stopping time is a random variable, and the corresponding mean value and probability distribution have been studied by many authors. The results are shown to be useful. For instance, they can be used to solve the Gambler’s Ruin problem.[42] Nevertheless, the stopping time of a QW has not been studied before.
In this paper, we develop a method to calculate the probability distribution of the stopping time for a discrete-time one-dimensional bounded QW. With our method, we calculate the probability distribution and the mean value of the stopping time and moreover compare the properties of stopping time for QW and RW. We show that their mean values for the stopping time are the same. However, the probability distributions associated with the stopping time are quite different for these two problems. In particular, over short-time intervals, the probability density of the stopping time of a QW is larger than that for a RW. This means that a quantum walker has a greater probability of arriving at boundary earlier than a classical walker. Our result is also illustrated via the analysis of the commutative probability of a QW and a RW.
The remainder of this paper is organized as follows. In Section 1, we briefly introduce the definition and properties of the stopping time of a RW. In Section 3, we show our method for the calculation of the probability distribution of the stopping time for a QW. In Section 4, we use our method to compare the properties of the stopping time for QW and RW. There is a brief summary in Section 5.
To introduce the definition and mathematical properties of a discrete-time one-dimensional RW, we consider a walker starting from the origin. In the RW, in each step the walker flips an unbiased coin and moves to the right (left) if the coin shows a head (tail). After t steps, the position x of the walker is a random variable, and satisfies the binomial distribution
Now, we introduce the definition of stopping time of a RW. We consider a RW in which the walker starts from the origin x = 0. We assume that there is a pair of dam-boards (i.e., boundary) at positions x = ±Xd, and the RW terminates immediately when the walker arrives at one of these dam-boards (Fig.
The stopping time Ts defined above is clearly a random variable; its distribution depends on the position Xd of the dam-boards, and can be denoted as P(Xd)(Ts). Accordingly, the mean value of the stopping time is also a function of Xd, here denoted as
We now introduce the QW, in which both walker and coin are quantum systems. The total Hilbert space is 𝓗 = 𝓗w ⊗ 𝓗c, where 𝓗w and 𝓗c are the Hilbert spaces for the walker and coin, respectively. Here, 𝓗w is spanned by position eigen-states |x〉w (x = 0,±1,±2,…) of the walker, and 𝓗c is spanned by “spin” states |H〉c and |T〉c, representing the head and tail, respectively, of the coin.
In the beginning of a QW, the walker is at the origin and the coin is prepared in a superposition of head and tail. Specifically, the initial state is
In the first step, the coin is first operated by a Hadamard gate
The physical meaning of US is that the walker moves to the right if the coin shows a head, and moves to the left if the coin shows a tail. Thus, after the first step, the state of the total system is
In this QW process, the walker and coin are entangled. Because of quantum interference effects, which can be constructive or destructive, the probability distribution of the walker’s position is completely different from that for RW (Eq. (
It is pointed out that, the QW can be reduced to a classical RW under the decoherence operation in each step.[44] For our system, we can obtain the results of RW via replacing Eqs. (
Next, we introduce our method for the calculation of the probability distribution of the stopping time of a QW, i.e., the probability distribution for the number of steps Ts at which the walker arrives at the dam-board at x = ±Xd (Xd > 0) for the first time. This probability distribution can be denoted as P(Xd)(Ts) and can be calculated as follows.
Given the above method, we calculated the probability P(Xd)(Ts) numerically. Because this QW is bounded between –Xd and Xd, the dimension of the Hilbert space for the walker’s spatial position is 2Xd + 1; similarly, the dimension for the coin’s spin space is 2. Therefore, the density matrix of the system is a matrix (4Xd + 2) × (4Xd + 2) for the entire process. Theoretically, the random variable t extends to infinity and therefore this evolution is capable of working out all probabilities P(t) (Fig.
With the method developed above, we numerically calculate the probability distribution of the stopping time Ts for many discrete-time one-dimensional QWs with different positions Xd of the dam-boards. With our result, we further derive the mean E(Xd)[Ts] of Ts. We find that for fixed values of Xd, the mean value of the stopping time of a QW and a RW are same. Specifically, for a QW we also have
Although the mean value of the stopping time Ts for both QW and RW are the same, the probability distribution of Ts for these two cases are completely different. Figure
Our numerical calculations show that this character is universal for QW for different values of Xd. From Fig.
In addition to the above features, our calculation also shows that when Ts is large, the decay of P(Xd)(Ts) for QW is slower than that for RW (Fig.
In the section above, we showed that in comparison with a RW, the probability distribution P(Xd)(Ts) of the stopping time for a QW peaks at smaller values of Ts, and has a larger peak value Pmax. This property implies that for a given value of Xd, the walker of a QW has a large probability (more than 50%) of arriving at the dam-boards earlier than a walker of a RW. That is, we have a large probability for the fact that “QW is faster”.
To verify this result, we numerically calculated the probability Q(Xd) for the fact that “QW is faster”. This probability can be reasonably defined as
Finally, we study the cumulative probability for a QW, which is defined as the probability that the walker arrives at the dam-boards before time T. Denoted as F(Xd)(T), we can express it as
In Fig.
Figure
We have developed a method to calculate the probability distribution of the stopping time of a QW. With this method, we further studied the properties of this probability distribution and its mean value. We find that the mean value of the stopping time for QW and RW are the same. However, the distribution of QW and RW are quite different. For QW, the probability for short stopping times is significantly larger than that for RW, and the difference between the distribution of QW and RW increases with distance Xd between the dam-boards and the starting point of the walker. Our result implies that the walker in a QW has a large probability (more than 50%) of arriving at the boundary earlier than the walker of a RW. We also illustrated our result with the analysis for the cumulative probability for a QW and a RW. Our results, which show that a quantum walker has a very large probability to be faster than a classical walker, may be used in quantum search problems. In addition, with our result one can also further study the quantum version of classical problems related to stopping time, such as the Gambler’s ruin problem.
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | |
10 | |
11 | |
12 | |
13 | |
14 | |
15 | |
16 | |
17 | |
18 | |
19 | |
20 | |
21 | |
22 | |
23 | |
24 | |
25 | |
26 | |
27 | |
28 | |
29 | |
30 | |
31 | |
32 | |
33 | |
34 | |
35 | |
36 | |
37 | |
38 | |
39 | |
40 | |
41 | |
42 | |
43 | |
44 |